Regularization parameter determination for discrete ill-posed problems

Straightforward solution of discrete ill-posed linear systems of equations or leastsquares problems with error-contaminated data does not, in general, give meaningful results, because propagated error destroys the computed solution. The problems have to be modified to reduce their sensitivity to the error in the data. The amount of modification is determined by a regularization parameter. It can be difficult to determine a suitable value of the regularization parameter when no knowledge of the norm of error in the data is available. This paper proposes a new simple technique for determining a value of the regularization parameter that can be applied in this situation. It is based on comparing computed solutions determined by Tikhonov regularization and truncated singular value decomposition. Analogous comparisons are proposed for large-scale problems. The technique for determining the regularization parameter implicity provides an estimate for the norm of the error in the data.